A Generalized Syllogistic Inference System based on Inclusion and Exclusion Relations
نویسندگان
چکیده
Entailment relations are of central importance in the enterprise of natural language semantics. In modern logic, entailment relations are characterized from two viewpoints: the modeltheoretic and proof-theoretic ones. By contrast, most approaches to formalizing entailment relations in natural languages have been solely based on model-theoretic conceptions. Thus, the notion of validity is only characterized in model-theoretic terms, and only few attempts have been made at the relevant proof-theoretic notions such as provability and proof as applied to natural language inferences. The main aim of our study is to offer a simple inference system for syllogistic fragment of natural language, thereby making a connection between proof theory and natural language semantics. Indeed, there are several prior attempts in this direction.1 One is the study of syllogisms from modern logical viewpoints, which was started by à Lukasiewicz [7] and subsequently given their natural deduction formulations by Corcoran [2] and Smiley [23], among others. In connection with this, the program of natural logics, including the so-called calculus of monotonicity proposed in van Benthem [24] and Sanchez [20], has been developed by some linguists and logicians.2 More recently, there are important developments in the logic and AI literature which aim to extend the traditional syllogistic system to cover more expressive fragments of natural language (cf. Nishihara, Morita, and Iwata [17], Nishihara and Morita [16], Moss [13, 14, 15], and Pratt-Hartmann and Moss [18]). The central aim of these studies is to characterize natural language inferences at the forms as close as possible to surface forms. Our approach agrees with these studies in that a proof system plays a role in characterizing entailment relations in natural languages. However, an essential difference is that we decompose syllogistic inferences and categorical sentences constituting them in terms of more primitive relations (i.e., inclusion and exclusion relations), whereas most approaches in modern logical studies of syllogisms and natural logic take surface forms as primitive and do
منابع مشابه
The probability heuristics model of syllogistic reasoning.
A probability heuristic model (PHM) for syllogistic reasoning is proposed. An informational ordering over quantified statements suggests simple probability based heuristics for syllogistic reasoning. The most important is the "min-heuristic": choose the type of the least informative premise as the type of the conclusion. The rationality of this heuristic is confirmed by an analysis of the proba...
متن کاملEstimating the Optimal Dosage of Sodium Valproate in Idiopathic Generalized Epilepsy with Adaptive Neuro-Fuzzy Inference System
Introduction: Epilepsy is a clinical syndrome in which seizures have a tendency to recur. Sodium valproate is the most effective drug in the treatment of all types of generalized seizures. Finding the optimal dosage (the lowest effective dose) of sodium valproate is a real challenge to all neurologists. In this study, a new approach based on Adaptive Neuro-Fuzzy Inference System (ANFIS) was pre...
متن کاملTwo Types of Diagrammatic Inference Systems: Relation-based System as Natural Deduction and Region-based System as Resolution
Since the 1990s, reasoning with Venn and Euler diagrams has been studied from mathematical and logical viewpoints. The standard approach to a formalization is a “regionbased” approach, where a diagram is defined as a set of regions. An alternative is a “relation-based” approach, where a diagram is defined in terms of topological relations (inclusion and exclusion) between circles and points. In...
متن کاملRobust H_∞ Controller design based on Generalized Dynamic Observer for Uncertain Singular system with Disturbance
This paper presents a robust ∞_H controller design, based on a generalized dynamic observer for uncertain singular systems in the presence of disturbance. The controller guarantees that the closed loop system be admissible. The main advantage of this method is that the uncertainty can be found in the system, the input and the output matrices. Also the generalized dynamic observer is used to est...
متن کاملA Reconstruction of Aristotle’s Modal Syllogistic
Ever since Łukasiewicz, it has been opinio communis that Aristotle’s modal syllogistic is incomprehensible due to its many faults and inconsistencies, and that there is no hope of finding a single consistent formal model for it. The aim of this paper is to disprove these claims by giving such a model. My main points shall be, first, that Aristotle’s syllogistic is a pure term logic that does no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 100 شماره
صفحات -
تاریخ انتشار 2012